A Helly-type theorem for higher-dimensional transversals
نویسندگان
چکیده
We generalize the Hadwiger(-Danzer-Grünbaum-Klee) theorem on line transversals for an unbounded family of compact convex sets to the case of transversal planes of arbitrary dimension. This is the first Helly-type theorem known for transversals of dimension between 1 and d− 1.
منابع مشابه
On the Helly Number for Hyperplane Transversals to Unit Balls
We prove some results about the Hadwiger problem of nding the Helly number for line transversals of disjoint unit disks in the plane, and about its higher-dimensional generalization to hyperplane transversals of unit balls in d-dimensional Euclidean space. These include (a) a proof of the fact that the Helly number remains 5 even for arbitrarily large sets of disjoint unit disks|thus correcting...
متن کامل4 Helly-type Theorems and Geometric Transversals
INTRODUCTION Let F be a family of convex sets in R. A geometric transversal is an affine subspace that intersects every member of F . More specifically, for a given integer 0 ≤ k < d, a k-dimensional affine subspace that intersects every member of F is called a ktransversal to F . Typically, we are interested in necessary and sufficient conditions that guarantee the existence of a k-transversal...
متن کامل4 Helly - Type Theorems and Geometric
INTRODUCTION Let F be a family of convex sets in R. A geometric transversal is an affine subspace that intersects every member of F . More specifically, for a given integer 0 ≤ k < d, a k-dimensional affine subspace that intersects every member of F is called a ktransversal to F . Typically, we are interested in necessary and sufficient conditions that guarantee the existence of a k-transversal...
متن کاملHelly-Type Theorems and Generalized Linear Programming
Recent combinatorial algorithms for linear programming can also be applied to certain non-linear problems. We call these Generalized Linear Programming, or GLP, problems. We connect this class to a collection of results from combinatorial geometry called Helly-type theorems. We show that there is a Helly-type theorem about the constraint set of every GLP problem. Given a family H of sets with a...
متن کاملGeometric permutations of disjoint unit spheres
We show that a set of n disjoint unit spheres in R admits at most two distinct geometric permutations if n ≥ 9, and at most three if 3 ≤ n ≤ 8. This result improves a Helly-type theorem on line transversals for disjoint unit spheres in R: if any subset of size 18 of a family of such spheres admits a line transversal, then there is a line transversal for the entire family.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Geom.
دوره 21 شماره
صفحات -
تاریخ انتشار 2002